Bandwidth consecutive multicolorings of graphs
نویسندگان
چکیده
منابع مشابه
On the bandwidth of Mobius graphs
Bandwidth labelling is a well known research area in graph theory. We provide a new proof that the bandwidth of Mobius ladder is 4, if it is not a $K_{4}$, and investigate the bandwidth of a wider class of Mobius graphs of even strips.
متن کاملon the bandwidth of mobius graphs
bandwidth labelling is a well known research area in graph theory. we provide a new proof that the bandwidth of mobius ladder is 4, if it is not a $k_{4}$, and investigate the bandwidth of a wider class of mobius graphs of even strips.
متن کاملEdge-Bandwidth of Graphs
The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum difference between labels of two incident edges. We prove that edgebandwidth is at least as large as bandwidth for every graph, with equality for certain caterpillars. We obtain sharp or nearly sharp bounds on the change in edge-bandwidth under addition, subdivision, or contracti...
متن کاملCircular consecutive choosability of graphs
Abstract This paper considers list circular colouring of graphs in which the colour list assigned to each vertex is an interval of a circle. The circular consecutive choosability chcc(G) of G is defined to be the least t such that for any circle S(r) of length r ≥ χc(G), if each vertex x of G is assigned an interval L(x) of S(r) of length t, then there is a circular r-colouring f of G such that...
متن کاملThe Complexity of Tree Multicolorings
The multicoloring problem is that given a graph G and integer demands x(v) for every vertex v, assign a set of x(v) colors to vertex v, such that neighboring vertices have disjoint sets of colors. In the preemptive sum multicoloring problem the finish time of a vertex is defined to be the highest color assigned to it. The goal is to minimize the sum of the finish times. The study of this proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.02.015